#include<cstdio>//uncle-lu
#include<algorithm>
template<class T>void read(T &x)
{
	x=0;int f=0;char ch=getchar();
	while(ch<'0'||ch>'9') { f|=(ch=='-'); ch=getchar(); }
	while(ch<='9'&&ch>='0') { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); }
	x = f ? -x : x;
	return ;
}

int n;
int line[110];
int F1[110], F2[110];

int main()
{
	read(n);
	for (int i = 1; i <= n; i++) 
	{
		read(line[i]);
	}

	for (int i = 1; i <= n; i++) 
		for (int j = 0; j <= i-1; j++) 
			if(line[i] > line[j])
				F1[i] = std::max(F1[i], F1[j] + 1);

	for (int i = n; i >= 1; i--) 
		for (int j = n+1; j >= i+1; j--) 
			if(line[i] > line[j])
				F2[i] = std::max(F2[i], F2[j] + 1);

	int ans = 0;
	for (int i = 1; i <= n; i++) 
		ans = std::max(ans, F1[i] + F2[i] - 1);

	printf("%d", n - ans);
	return 0;
}
